Data-Structures-and-Algorithms/Trees/Leetcode-222. Count Complete Tree Nodes.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Trees/Leetcode-222. Count Complete Tree Nodes.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.8 (321 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
classSolution {
public:
 vector<int>num;
intcountNodes(TreeNode* root) {
if(root==NULL)return0;
 queue<TreeNode*>q;
 q.push(root);
while(!q.empty()){
 TreeNode*curr = q.front();
 num.push_back(curr->val);
if(curr->left!=NULL)
 q.push(curr->left);
if(curr->right!=NULL)
 q.push(curr->right);
 q.pop();
 }
return num.size();
 }
};